منابع مشابه
New Multi-dividing Ontology Learning Algorithm Using Special Loss Functions
As an important data structure model, ontology has become one of the core contents in information science. Multi-dividing ontology algorithm combines the advantages of graph structure and learning algorithms proved to have high efficiency. In this paper, in terms of multi-dividing proper loss functions, we propose new multi-dividing ontology learning algorithms for similarity measure and ontolo...
متن کاملAmple dividing
We construct a stable one-based, trivial theory with a reduct which is not trivial. This answers a question of John B. Goode. Using this, we construct a stable theory which is n-ample for all natural numbers n, and does not interpret an infinite group.
متن کاملA Dividing Stretcher
on it throughout the operation, and when it was over bamboo poles were slid into the hem on each side and two looped iron rods passed over the ends of the poles to keep the stretcher from sagging. The patient was then lifted on to a wheeled carriage and taken to his bed side. Here the difficulty of lifting the patient off the stretcher into bed without any exertion on his part was often very ap...
متن کاملDividing and chain conditions
We obtain a chain condition for dividing in an arbitrary theory and a new and shorter proof of a chain condition result of Shelah for simple theories.
متن کاملDividing and Conquering
We suggest that the components of the well known divide-and-conquer paradigm can be prootably presented as independent constructs in a skeletal parallel programming model. We investigate this proposal in the context of a rendition of Batcher's bitonic sorting algorithm in which the nested parallel structure of the program is neatly abstracted from the low level detail of a at presentation. We s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Franklin Institute
سال: 1859
ISSN: 0016-0032
DOI: 10.1016/0016-0032(59)90591-5